A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem
نویسندگان
چکیده
A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic assignment problem is described in detail. Computational experience on a large set of standard test problems (QAPLIB) is presented.
منابع مشابه
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملA GRASP for the Biquadratic Assignment Problem
routines for approximate solution of dense quadratic assignment problems A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic assign-for approximate solution of sparse quadratic assignment problems using
متن کاملFacility-wide Planning and Scheduling of Printed a Grasp for Single Machine Scheduling with Sequence Dependent Setup Costs and Linear Delay Penalties, Tech. Report, Operations Procedure Grasp()
A greedy randomized adaptive search procedure for the quadratic assignment problem, A new method for solving hard Sat-A greedy randomized adaptive search procedure for the 2-partition problem,
متن کاملA Parallel GRASP Implementation for the Quadratic Assignment Problem
A greedy randomized adaptive search procedure for maximum independent set. A greedy randomized adaptive search procedure for the quadratic assignment problem. subroutines for approximate solution of dense quadratic assignment problems using GRASP. Table 2: grasp-parallel-sparse empty permutation, and local search is applied to the constructed solution for further improvement. The best solution ...
متن کاملAn Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic algorithm, which is applied to the quadratic assignment problem. We refer this algorithm to as intensive search algorithm (or briefly intensive search). We tested our algorithm on the various instances from the library...
متن کامل